Obtaining splits from cut sets of tight spans

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trees, tight-spans and point configurations

Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied by others, most notably by Dress, who gave them this name. Subsequently, it was found that tight-spans could be defined for more general maps, such as directed metrics and distances, and more recently for diversities. In this paper, we show that all of these tight-spans as well as some related constructi...

متن کامل

Isomorphisms of splits of computably enumerable sets

We show that if A and  are automorphic via 8 then the structures SR(A) and SR( Â) are 13-isomorphic via an isomorphism 9 induced by 8. Then we use this result to classify completely the orbits of hhsimple sets.

متن کامل

Stacks and splits of partially ordered sets

The dimension of a partiruly ordered set (X, P) is the smallest positive integer i for which there exists a function f which assigns to each x E X a sequence {f(x)(i): I s i 41) of TeaI numbers so that x Sy in P i! and only if f(x)(i)Sf(y)(i) for each i = 1,2,. , , , t. TIE irltelval ~lmension of (X, P) is the sm;.llcst integer t for which there exists a function F which assigns to 2ach x E X a...

متن کامل

Bounds on the f-vectors of tight spans

The tight span Td of a metric d on a finite set is the subcomplex of bounded faces of an unbounded polyhedron defined by d. If d is generic then Td is known to be dual to a regular triangulation of a second hypersimplex. A tight upper and a partial lower bound for the face numbers of Td (or the dual regular triangulation) are presented.

متن کامل

Searching for realizations of finite metric spaces in tight spans

An important problem that commonly arises in areas such as internet trafficflow analysis, phylogenetics and electrical circuit design, is to find a representation of any given metric D on a finite set by an edge-weighted graph, such that the total edge length of the graph is minimum over all such graphs. Such a graph is called an optimal realization and finding such realizations is known to be ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2013

ISSN: 0166-218X

DOI: 10.1016/j.dam.2013.02.001